Compositionally Progressive Solutions of Synchronous Language Equations
نویسندگان
چکیده
The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show that if a synchronous FSM equation has a compositionally progressive solution, then the equation has the largest compositionally progressive solution. However, not each reduction of the largest compositionally progressive solution is compositionally progressive. Since generally the number of reductions is infinite, the problem of characterizing all progressive solutions is non-trivial.
منابع مشابه
Compositionally Progressive Solutions of Synchronous FSM Equations
The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show tha...
متن کاملSequential Synthesis by Language Equation Solving
Consider the problem of designing a component that combined with a known part of a system, called the context, conforms to a given overall specification. This question arises in several applications ranging from logic synthesis to the design of discrete controllers. We cast the problem as solving abstract equations over languages and study the most general solutions under the synchronous and pa...
متن کاملComposition Operators in Language Equations
The paper addresses the problem of solving equations over languages, that model the problem of synthesizing an unknown component, both in hardware and software systems. We investigate what algebraic properties must be satisfied by a composition operator so that the related language equation yields a general solution of the same form, and show sufficient conditions to derive such a largest solut...
متن کاملOn The Expressiveness of Timed Concurrent Constraint Programming
We prove that both the synchronous data ow language Lustre restricted to nite value types and the synchronous state oriented language Argos are embedded in the synchronous paradigm Timed Concurrent Constraint (tcc). In fact, for each of the two languages we provide a tcc language encoding it compositionally w.r.to the structure of programs. Moreover, we prove that the \strong abortion" mechanis...
متن کاملCompositional synthesis of latency-insensitive systems from multi-clocked synchronous specifications
We consider the problem of synthesizing correct-by-construction globally asynchronous, locally synchronous (GALS) implementations from modular synchronous specifications. This involves the synthesis of asynchronous wrappers that drive the synchronous clocks of the modules and perform input reading in such a fashion as to preserve, in a certain sense, the global properties of the system. Our app...
متن کامل